R-Hash: Hash Function Using Random Quadratic Polynomials Over GF(2)

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

Cryptanalysis of GOST R Hash Function

GOST R is the hash function standard of Russia. This paper presents some cryptanalytic results on GOST R. Using the rebound attack technique, we achieve collision attacks on the reduced round compression function. Result on up to 9.5 rounds is proposed, the time complexity is 2 and the memory requirement is 2 bytes. Based on the 9.5-round collision result, a limited birthday distinguisher is pr...

A Hash Function System Based on Quadratic Function

A hash function is a function that takes a set of characters called plaintext and converts it to a form that is very difficult to revert back to the original set of characters. Hash functions play very important role in computer security, computer vision, bloom filters and search algorithms. The current cryptographic hash functions such as Hashed Message Authentication Code (HMAC), Message Dige...

Hash Function

Random Forests Can Hash

Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first time how random forest, a technique that together with deep learning have shown spectacular results in classification, can also be extended to large-scale retri...